Simplified tabu search with random-based searches for bound constrained global optimization

This paper proposes a simplified version of the tabu search algorithm that solely uses randomly generated direction vectors in the exploration and intensification search procedures, in order to define a set of trial points while searching in the neighborhood of a given point. In the diversification procedure, points that are inside any already visited region with a relative small visited frequency may be accepted, apart from those that are outside the visited regions. The produced numerical results show the robustness of the proposed method. Its efficiency when compared to other known metaheuristics available in the literature is encouraging.FCT - Fundação para a Ciência e a Tecnologia(UIDB/00013/2020); FCT – Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020, UIDB/00013/2020 and UIDP/00013/2020 of CMAT-UM

The rolling problem: overview and challenges

In the present paper we give a historical account -ranging from classical to modern results- of the problem of rolling two Riemannian manifolds one on the other, with the restrictions that they cannot instantaneously slip or spin one with respect to the other. On the way we show how this problem has profited from the development of intrinsic Riemannian geometry, from geometric control theory and sub-Riemannian geometry. We also mention how other areas -such as robotics and interpolation theory- have employed the rolling model.Comment: 20 page

The design of the global navigation satellite system surveying networks using genetic algorithms

Genetic algorithms are mostly considered to represent the primary class of evolutionary methods that operate by combining solutions to produce better ones. In this paper, a very efficient method based on the concept of the genetic algorithms metaheuristic technique is developed for providing an efficient solution for observing a surveying network using space-based satellites systems. These systems are used to determine the geographical positions of unknown points on and above the earth and its oceans using suitable satellite receiving equipment. When related to satellite technology, a surveying network can be defined as a number of points which are co-ordinated by a series of observation sessions. These sessions are formed by placing receivers on the points of the network. An observation session can be defined as a period of time during which two or more receivers simultaneously record satellite signals. Thus, the schedule of receivers is a sequence of sessions to be observed consecutively. The goal is to select the best order in which these sessions can be organised to give the best possible solution at minimal cost. Several real space-based satellites surveying networks have been used to assess the performance of the proposed technique in terms of the solution quality and computational effort. © 2003 Elsevier Ltd. All rights rserved.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

Un algorithme de colonie d’abeilles artificielles optimisé pour une exploration intelligente de l’espace de recherche

International audienceno abstrac

A modified sensitivity analysis method for driving a multidimensional search in the Artificial Bee Colony algorithm

International audienceno abstrac

Un algorithme de colonie d’abeilles artificielles optimisé pour une exploration intelligente de l’espace de recherche

International audienceno abstrac

Une méthode d’analyse de sensibilité pour détecter l’influence de déplacements multiples

International audienceno abstrac